RIMS-1674 Reduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees By
نویسندگان
چکیده
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is ultrametric. We show that every ultrametric minimum cost spanning tree game is a cost allocation game on a rooted tree. It follows that there exist optimal algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametric minimum cost spanning tree games.
منابع مشابه
Reduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is an ultrametric. We show that every ultrametric minimum cost spanning tree game is reduced to a cost allocation game on a rooted tree. It follows that there exist O(n) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametri...
متن کاملCost monotonicity, consistency and minimum cost spanning tree games
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7
متن کاملCooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملAn efficient algorithm for nucleolus and prekernel computation in some classes of TU-games
We consider classes of TU-games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent result b...
متن کاملMinimum cost arborescences
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well-studied problem of minimum cost spanning tree games, where the costs are assumed to be symmetric. The focus is on rules which satisfy axioms re...
متن کامل